Route fragility: a novel metric for route selection in mobile ad hoc networks
نویسندگان
چکیده
A key factor deciding the performance of a routing protocol in mobile ad hoc networks is the manner in which it adapts to route changes caused by mobility. Exploiting the intuition that a less dynamic route lasts longer, we propose a new metric, the Route Fragility Coefficient (RFC), to compare routes. RFC estimates the rate at which a given route expands or contracts. Expansion refers to adjacent nodes moving apart, while contraction refers to their moving closer. RFC combines the individual link contraction or expansion behavior to present a unified picture of the route dynamics. We demonstrate that lower the value of RFC, more static (less fragile) the route. We then use this metric as a basis for route selection so that route discovery yields routes that last longer and hence increase throughput while reducing control overhead. We provide a simple distributed mechanism to compute RFC, so that a Route-Request (RREQ) packet contains the metric for the path it traversed, when it reaches the destination. The Dynamic Source Routing Protocol (DSR) is enhanced with the proposed metric in the NS-2 simulation environment. Simulation results are provided to demonstrate improvement in throughput and reduction in routing protocol overhead with increased mobility.
منابع مشابه
Creating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کاملCreating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کاملA New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm
Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملSurvey and Taxonomy of Unicast Routing Protocols for Mobile Ad Hoc Networks
The purpose of this paper is to survey the unicast routing protocols for mobile ad hoc networks (MANETs) and study their primary route selection principle. In this context, we did an exhaustive survey of unicast MANET routing protocols proposed in the literature. Qualitatively, based on their primary route selection principle, we show that all these protocols could be placed under one of two br...
متن کامل